# 
# model for finding a violated cover inequality 
# a fractional Knapsack solution y is assumed to be available. 

param n;
set PROPERTIES;
set N := 1..n;
param inputdata{N,PROPERTIES} >= 0;
param MaxCapacity;
param y{N};

var z{N} binary;

minimize violation1: sum {i in N} (1-y[i])*z[i];

subject to is_a_cover1:
sum{i in N} inputdata[i,'Weight']*z[i]>= MaxCapacity + 1; #assumes integer data

